منابع مشابه
Non - Euclidean Metric and Path Planning
In order to achieve the wide range of the robotic application it is necessary to provide iterative motions among points of the goals. For instance, in the industry mobile robots can replace any components between a storehouse and an assembly department. Ammunition replacement is widely used in military services. Working place is possible in ports, airports, waste site and etc. Mobile agents can...
متن کاملMetric Derivations on Euclidean and Non-euclidean Spaces
As introduced by Weaver, (metric) derivations extend the notion of differential operators on Euclidean spaces and provide a linear differentiation theory that is well-defined on all metric spaces with Borel measures. The main result of this paper is a rigidity theorem for measures on Euclidean spaces that support a maximal number of derivations. The proof relies substantially on ideas from geom...
متن کاملNeural networks in non-Euclidean metric spaces
Multilayer Perceptrons (MLPs) use scalar products to compute weighted activation of neurons providing decision borders using combinations of soft hyperplanes. The weighted fun-in activation function corresponds to Euclidean distance functions used to compute similarities between input and weight vector. Replacing the fan-in activation function by non-Euclidean distance function offers a natural...
متن کاملAdaptive Informative Path Planning in Metric Spaces
In contrast to classic geometric motion planning, informative path planning (IPP) seeks a path for a robot to sense the world and gain information. In adaptive IPP, the robot chooses the next sensing location conditioned on all information acquired so far, and the robot’s goal is to minimize the travel cost required for identifying a true hypothesis. Adaptive IPP is NP-hard, because the robot m...
متن کاملA Proximity Metric for Continuum Path Planning
The problem of planning motions of robot manipulators and similar mechanical devices in the presence of obstacles is one of keen interest to the artificial intelligence community. Most of the algorithms previously reported for solving such problems have been combinatorial algorithms, which work by partitioning the problem domain continuum into a finite set of equivalence classes, and applying c...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Computer Science & Engineering Survey
سال: 2016
ISSN: 0976-3252,0976-2760
DOI: 10.5121/ijcses.2016.7102